On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal Rank
نویسندگان
چکیده
In this paper, we consider polytopes P that are contained in the unit hypercube. We provide conditions on the set of infeasible 0,1 vectors that guarantee that P has a small Chvátal rank. Our conditions are in terms of the subgraph induced by these infeasible 0,1 vertices in the skeleton graph of the unit hypercube. In particular, we show that when this subgraph contains no 4-cycle, the Chvátal rank is at most 3; and when it has tree width 2, the Chvátal rank is at most 4. We also give polyhedral decomposition theorems when this graph has a vertex cutset of size one or two.
منابع مشابه
On Some Polytopes
In this paper, we consider polytopes P that are contained in the unit hypercube. We provide conditions on the set of infeasible 0,1 vectors that guarantee that P has a small Chvátal rank. Our conditions are in terms of the subgraph induced by these infeasible 0,1 vertices in the skeleton graph of the unit hypercube. In particular, we show that when this subgraph contains no 4-cycle, the Chvátal...
متن کاملBounds on the Chvátal Rank of Polytopes in the 0/1-Cube
Gomory’s and Chvátal’s cutting-plane procedure proves recursively the validity of linear inequalities for the integer hull of a given polyhedron. The number of rounds needed to obtain all valid inequalities is known as the Chvátal rank of the polyhedron. It is well-known that the Chvátal rank can be arbitrarily large, even if the polyhedron is bounded, if it is of dimension 2, and if its intege...
متن کاملOn the Rational Polytopes with Chvátal Rank 1
In this paper, we study the following problem: given a polytope P with Chvátal rank 1, does P contain an integer point? Boyd and Pulleyblank observed that this problem is in the complexity class NP ∩ co-NP, an indication that it is probably not NP-complete. We solve this problem in polynomial time for polytopes arising from the satisfiability problem of a given formula with at least three liter...
متن کاملCharacterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank
Let S ⊆ {0, 1} and R be any polytope contained in [0, 1] with R ∩ {0, 1} = S. We prove that R has bounded Chvátal-Gomory rank (CG-rank) provided that S has bounded pitch and bounded gap, where the pitch is the minimum integer p such that all p-dimensional faces of the 0/1-cube have a nonempty intersection with S, and the gap is a measure of the size of the facet coefficients of conv(S). Let H [...
متن کاملInteger-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank
We provide a complete characterization of all polytopes P ⊆ [0,1]n with empty integer hull whose Gomory-Chvátal rank is n (and, therefore, maximal). In particular, we show that the first GomoryChvátal closure of all these polytopes is identical.
متن کامل